A Constrained Nevanlinna-pick Interpolation Problem for Matrix-valued Functions
نویسنده
چکیده
Recent results of Davidson-Paulsen-Raghupathi-Singh give necessary and sufficient conditions for the existence of a solution to the NevanlinnaPick interpolation problem on the unit disk with the additional restriction that the interpolant should have the value of its derivative at the origin equal to zero. This concrete mild generalization of the classical problem is prototypical of a number of other generalized Nevanlinna-Pick interpolation problems which have appeared in the literature (for example, on a finitely-connected planar domain or on the polydisk). We extend the results of Davidson-PaulsenRaghupathi-Singh to the setting where the interpolant is allowed to be matrixvalued and elaborate further on the analogy with the theory of Nevanlinna-Pick interpolation on a finitely-connected planar domain.
منابع مشابه
Nevanlinna - Pick Interpolation For
We study the Nevanlinna-Pick problem for a class of subalgebras of H∞. This class includes algebras of analytic functions on embedded disks, the algebras of finite codimension in H∞ and the algebra of bounded analytic functions on a multiply connected domain. Our approach uses a distance formula that generalizes Sarason’s [18] work. We also investigate the difference between scalar-valued and m...
متن کاملA Constrained Nevanlinna-pick Interpolation Problem
We obtain necessary and sufficient conditions for NevanlinnaPick interpolation on the unit disk with the additional restriction that all analytic interpolating functions satisfy f ′(0) = 0. Alternatively, these results can be interpreted as interpolation results for H∞(V ), where V is the intersection of the bidisk with an algebraic variety. We use an analysis of C*-envelopes to show that these...
متن کاملA Fast Algorithm for Matrix-Valued Nevanlinna-Pick Interpolation
In this paper, we derive a new fast algorithm for the matrixvalued Nevanlinna-Pick interpolation. Given n distinct points zi in the unit disk jzj < 1 and n complex matrices Wk of dimension m m, satisfying the Pick condition for 1 k n, the new Nevanlinna-Pick interpolation algorithm requires only 20 3 nm 3 complex arithmetic operations to evaluate the matrix-valued interpolatory rational functio...
متن کاملTest Functions in Constrained Interpolation
We give a set of test functions for the interpolation problem on H 1 , the constrained interpolation problem studied byDavidson, Paulsen, Raghupathi and Singh. We show that this set of test functions is minimal. 1. Background and Introduction There has been increased interest in constrained interpolation problems recently. Theseproblems havemany of the unusual characteristics of harder interpol...
متن کاملNevanlinna–Pick interpolation for Schur–Agler class functions on domains with matrix polynomial defining function in C
We consider a bitangential interpolation problem for operatorvalued functions defined on a general class of domains in Cn (including as particular cases, Cartan domains of types I, II and III) which satisfy a type of von Neumann inequality associated with the domain. The compact formulation of the interpolation conditions via a functional calculus with operator argument includes prescription of...
متن کامل